Reactive Answer Set Programming

نویسندگان

چکیده

Abstract Logic Production System (LPS) is a logic-based framework for modelling reactive behaviour. Based on abductive logic programming, it combines rules with programs, database and causal theory that specifies transitions between the states of database. This paper proposes systematic mapping Kernel this (called KELPS) into an answer set program (ASP). For purpose new variant KELPS finite models, called n -distance KELPS, introduced. A formal definition from to ASP given proven sound complete. The Answer Set Programming paradigm allows capture additional behaviours basic reactivity in particular proactive, pre-emptive prospective behaviours. These are all discussed illustrated examples. Then hybrid proposed integrates ASP, allowing combine strengths both paradigms.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reactive Answer Set Programming

We introduce the first approach to Reactive Answer Set Programming, aiming at reasoning about real-time dynamic systems running online in changing environments. We start by laying the theoretical foundations by appeal to module theory. With this, we elaborate upon the composition of the various offline and online programs in order to pave the way for stream-driven grounding and solving. Finally...

متن کامل

Action Learning with Reactive Answer Set Programming: Preliminary Report

Action learning is a process of automatic induction of knowledge about domain dynamics. The idea to use Answer Set Programming (ASP) for the purposes of action learning has already been published in [2]. However, in reaction to latest introduction of Reactive ASP and implementation of effective tools [6], we propose a slightly different approach, and show how using the Reactive ASP together wit...

متن کامل

Annotated Answer Set Programming

We present Annotated Answer Set Programming, that extends the expressive power of disjunctive logic programming with annotation terms, taken from the generalized annotated logic programming framework.

متن کامل

Constraint Answer Set Programming

Constraint answer set programming (CASP) is a novel, promising direction of research whose roots go back to propositional satisfiability (SAT). SAT solvers are efficient tools for solving boolean constraint satisfaction problems that arise in different areas of computer science, including software and hardware verification. Some constraints are more naturally expressed by non-boolean constructs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory and Practice of Logic Programming

سال: 2022

ISSN: ['1471-0684', '1475-3081']

DOI: https://doi.org/10.1017/s147106842100051x